Robust high-order repetitive control: Optimal performance trade-offs
نویسندگان
چکیده
منابع مشابه
Discrete-time repetitive optimal control: Robotic manipulators
This paper proposes a discrete-time repetitive optimal control of electrically driven robotic manipulators using an uncertainty estimator. The proposed control method can be used for performing repetitive motion, which covers many industrial applications of robotic manipulators. This kind of control law is in the class of torque-based control in which the joint torques are generated by permanen...
متن کاملPractical Trade-offs in Robust Target Following
This article discusses two Lyapunov based robust target following techniques and introduces a method based on the superposition of elementary vehicle dynamics. All three approaches are discussed and physically tested together with a known Lyapunov method for closed loop control. Emphasis is given on the discussion of distinguishing features and parameters relevant for practical selection of tar...
متن کاملOptimal Trade-offs in Distribution Protection Design
The number, type and location of the protective devices on a distribution feeder have a direct effect on the system reliability. In earlier work, a technique was developed to design a protective system in order to minimize the SAIFI index. This paper extends earlier results by using a goal programming approach to achieve compromises among various engineering objectives. The design goals are: a)...
متن کاملOptimal Time-Space Trade-Offs for Sorting
We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem. Beame has shown a lower bound of Ω(n) for this product leaving a gap of a logarithmic factor up to the previously best known upper bound of O(n log n) due to Frederickson. Since then, no progress has been made towards ...
متن کاملOptimal Trade-Offs for Succinct String Indexes
Let s be a string whose symbols are solely available through access(i), a read-only operation that probes s and returns the symbol at position i in s. Many compressed data structures for strings, trees, and graphs, require two kinds of queries on s: select(c, j), returning the position in s containing the jth occurrence of c, and rank(c, p), counting how many occurrences of c are found in the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2008
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2008.02.028